Πλοήγηση ανά Θέμα "Query processing"
Αποτελέσματα 1-20 από 27
-
A-tree: Distributed indexing of multidimensional data for cloud computing environments
(2011)Efficient querying of huge volumes of multidimensional data stored in cloud computing systems has become a necessity, due to the widespread of cloud storage facilities. With clouds getting larger and available data growing ... -
Bulk insertions into xBR+-trees
(2017)Bulk insertion refers to the process of updating an existing index by inserting a large batch of new data, treating the items of this batch as a whole and not by inserting these items one-by-one. Bulk insertion is related ... -
Bulk-loading xBR+-trees
(2016)Spatial indexes are important in spatial databases for efficient execution of queries involving spatial constraints. The xBR+-tree is a balanced disk-resident quadtree-based index structure for point data, which is very ... -
A Data Warehouse Approach for Business Intelligence
(2019)In a cloud based data warehouse (DW), business users can access and query data from multiple sources and geographically distributed places. Business analysts and decision makers are counting on DWs especially for data ... -
Database design of a geo-environmental information system
(2014)Environmental protection from productive investments becomes a major task for enterprises and constitutes a critical competitiveness factor. The region of Central Greece presents many serious and particular environmental ... -
Double chain-star: An RDF indexing scheme for fast processing of SPARQL joins
(2016)State of the art RDF stores often rely on exhaustive indexing and sequential (self-)joins for SPARQL query processing. However, query execution is dependent on, and often limited by the underlying storage and indexing ... -
An efficient algorithm for bulk-loading xBR+-trees
(2018)A major part of the interface to a database is made up of the queries that can be addressed to this database and answered (processed) in an efficient way, contributing to the quality of the developed software. Efficiently ... -
An efficient flash-aware spatial index for points
(2018)Spatial database systems often employ spatial indices to speed up the processing of spatial queries. In addition, modern spatial database applications are interested in exploiting the positive characteristics of flash-based ... -
Efficient query processing on large spatial databases: A performance study
(2017)Processing of spatial queries has been studied extensively in the literature. In most cases, it is accomplished by indexing spatial data using spatial access methods. Spatial indexes, such as those based on the Quadtree, ... -
The EvoGen benchmark suite for evolving RDF data
(2016)Artificial and synthetic data are widely used for benchmarking and evaluating database, storage and query engines. This is usually performed in static contexts with no evolution in the data. In the context of evolution ... -
Extended characteristic sets: Graph indexing for SPARQL Query Optimization
(2017)SPARQL query execution in state of the art RDF engines depends on, and is often limited by the underlying storage and indexing schemes. Typically, these systems exhaustively store permutations of the standard three-column ... -
Extended OQL for object oriented parallel query processing
(2007)Herein, an extension to the object query language (OQL) for incorporating binary relational expressions is investigated. The extended query language is suitable for query submissions to an object oriented database, whose ... -
Grid-file: Towards to a flash efficient multi-dimensional index
(2015)Spatial indexes are of great importance for multidimensional query processing. Traditional data structures have been optimized for magnetic disks in the storage layer. In the recent years flash solid disks are widely ... -
Improving Distance-Join Query processing with Voronoi-Diagram based partitioning in SpatialHadoop
(2020)SpatialHadoop is an extended MapReduce framework supporting global indexing techniques that partition spatial datasets across several machines and improve spatial query processing performance compared to traditional Hadoop ... -
The K group nearest-neighbor query on non-indexed RAM-resident data
(2016)Data sets that are used for answering a single query only once (or just a few times) before they are replaced by new data sets appear frequently in practical applications. The cost of buiding indexes to accelerate query ... -
Nearest Neighbor Algorithms using xBR-Trees
(2011)One of the common queries in spatial databases is the (K) Nearest Neighbor Query that discovers the (K) closest objects to a query object. Processing of spatial queries, in most cases, is accomplished by indexing spatial ... -
New plane-sweep algorithms for distance-based join queries in spatial databases
(2016)Efficient and effective processing of the distance-based join query (DJQ) is of great importance in spatial databases due to the wide area of applications that may address such queries (mapping, urban planning, transportation ... -
On the Implementation of a Software-Defined Memory Control Plane for Disaggregated Datacenters
(2022)By adopting a disaggregated hardware architecture, datacenters can achieve considerable efficiency gains and transition to a more sustainable and green future. By decoupling resources from a single monolithic server and ... -
Parallel processing of spatial batch-queries using xBR + -trees in solid-state drives
(2020)Efficient query processing in spatial databases is of vital importance for numerous modern applications. In most cases, such processing is accomplished by taking advantage of spatial indexes. The xBR +-tree is an index for ... -
Porting disk-based spatial index structures to flash-based solid state drives
(2022)Indexing data on flash-based Solid State Drives (SSDs) is an important paradigm recently applied in spatial data management. During last years, the design of new spatial access methods for SSDs, named flash-aware spatial ...